منابع مشابه
Symmetrizing quantum dynamics beyond gossip-type algorithms
Recently, consensus-type problems have been formulated in the quantum domain. Obtaining average quantum consensus consists in the dynamical symmetrization of a multipartite quantum system while preserving the expectation of a given global observable. In this paper, two improved ways of obtaining consensus via dissipative engineering are introduced, which employ on quasi local preparation of mix...
متن کاملGossip Algorithms
Unlike the Telephone network or the Internet, many of the next generation networks are not engineered for the purpose of providing efficient communication between various networked entities. Examples abound: sensor networks, peer-to-peer networks, mobile networks of vehicles and social networks. Indeed, these emerging networks do require algorithms for communication, computation, or merely spre...
متن کاملAverage consensus in sensor networks via broadcast multi-gossip algorithms
Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we propose a distributed algorithm called broadcast based multi-gossiping algorithm (BMGA), which is designed for exchanging information and computing in an arbitrarily connected network of nodes. Unlike traditional randomized gossip algorithms, push-sum mechanism based BMGA preserves the sums and weights, and admi...
متن کاملConsensus for Quantum Networks: From Symmetry to Gossip Iterations
This paper extends the consensus framework, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. We define consensus situations on the basis of invariance and symmetry properties, finding four different probabilistic generalizations of classical consensus states. We then extend the gossip consensus algorithm to the quantum setting and...
متن کاملAsynchronous Gossip in Multiplex Networks
In this work, we take a first step to investigate information spreading in multiplex networks, adopting the gossip (randomwalk) based model. Two key features of multiplex networks allow potentially much faster information spreading: availability of multiple channels and communication actions for each user, and more choices on neighbor contacting. As a first work in this area, we explored the im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2017
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2016.10.057